Efficient Hardware Montgomery Modular Inverse Module for Elliptic Curve Cryptosystem in GF(p)
نویسندگان
چکیده
منابع مشابه
Area-Time Efficient Hardware Implementation of Elliptic Curve Cryptosystem
The strength of ECC lies in the hardness of elliptic curve discrete logarithm problem (ECDLP) and the hight level security with significantly smaller keys. Thus, using smaller key sizes is a gain in term of speed, power, bandwidth, and storage. Point multiplication is the most common operation in ECC and the most used method to compute it is Montgomery Algorithm. This paper describes an area-ef...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملThe Elliptic Curve Cryptosystem
The Elliptic Curve Cryptosystem (ECC) provides the highest strength-per-bit of any cryptosystem known today. This paper provides an overview of the three hard mathematical problems which provide the basis for the security of publickey cryptosystems used today: the integer factorization problem (IFP), the discrete logarithm problem (DLP), and the elliptic curve discrete logarithm problem (ECDLP)...
متن کاملEfficient Elliptic Curve Point Multiplication with Montgomery Ladder Algorithm
Scalar point multiplication has encountered significant attention in Elliptic curve cryptography (ECC) which is gaining popularity due to providing same level security with smaller key sizes compared to traditional cryptosystems, such as Ron Rivest, Adi Shamir, and Leonard Adleman (RSA). Point multiplication (KP) in ECC is basically performed on point addition and point doubling on elliptic cur...
متن کاملThe Montgomery Modular Inverse-Revisited
We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the KaliskiMontgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korea Multimedia Society
سال: 2017
ISSN: 1229-7771
DOI: 10.9717/kmms.2017.20.2.289